منابع مشابه
Clustering Aggregation as Maximum-Weight Independent Set
We formulate clustering aggregation as a special instance of Maximum-Weight Independent Set (MWIS) problem. For a given dataset, an attributed graph is constructed from the union of the input clusterings generated by different underlying clustering algorithms with different parameters. The vertices, which represent the distinct clusters, are weighted by an internal index measuring both cohesion...
متن کاملSegmentation as Maximum-Weight Independent Set
Given an ensemble of distinct, low-level segmentations of an image, our goal is to identify visually “meaningful” segments in the ensemble. Knowledge about any specific objects and surfaces present in the image is not available. The selection of image regions occupied by objects is formalized as the maximum-weight independent set (MWIS) problem. MWIS is the heaviest subset of mutually non-adjac...
متن کاملA Variant of the Maximum Weight Independent Set Problem
We study a natural extension of the Maximum Weight Independent Set Problem (MWIS), one of the most studied optimization problems in Graph algorithms. We are given a graph G = (V,E), a weight function w : V → R, a budget function b : V → Z, and a positive integer B. The weight (resp. budget) of a subset of vertices is the sum of weights (resp. budgets) of the vertices in the subset. A k-budgeted...
متن کاملHybrid Heuristic for the Maximum-Weight Independent Set Problem
We propose an approximate algorithm for finding the maximum-weight independent set of a given graph of n nodes with associated weights. It combines three different heuristics, and its running time is O(n2) in the practice. We also propose a set of random graphs for testing and comparing the maximumweight independent set algorithms. This graphs are easy to identically generate on any computer ca...
متن کاملConversion of Coloring Algorithms into Maximum Weight Independent Set Algorithms
A very general technique for converting approximation algorithms for the vertex coloring problem in a class of graphs into approximation algorithms for the maximum weight independent set problem (MWIS) in the same class of graphs is presented. The technique consists of solving an LP-relaxation of the MWIS problem with certain clique inequalities, constructing an instance of the vertex coloring ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BIT
سال: 1987
ISSN: 0006-3835,1572-9125
DOI: 10.1007/bf01937282